#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int p[100010];
int main()
{
	int n,t;
	cin>>n>>t;
	for(int i=0;i<n;i++)
	{
		scanf("%d",p+i);
	}
	sort(p,p+n);
	int ans=0;
	int r=n-1;
	int l=0;
	while(r>=l)
	{
		if(p[r]>t)
		{
			r--;
			ans++;
			continue;
		}
		int num=t/p[r]+1;
		if(num<=r-l+1)
		{
			r--;
			l+=num-1;
			n-=num;
			ans++;
		}
		else
		{
			break;
		}
	}
	cout<<ans;
	return 0;
}
